Pii: S0031-3203(96)00086-6

نویسنده

  • JYH-YUAN DENG
چکیده

-We propose an improved method for eye-feature extraction, descriptions, and tracking using deformable templates. Some existing algorithms are exploited to locate the initial position of eye features and then deformable templates are used for extracting and describing the eye features. Rather than using original energy minimization for matching the templates, the region-based approach is proposed for template deformation. Based on the region properties, the new strategy avoids problems such as template shrinking, adjusting the weights of energy terms, failure of orientation adjustment due to some exceptional cases. Our strategies are also coupled with Canny edge operator to give a new back-end processing. By integrating the local edge information from the edge detection and the global collector from our region-based template deformation, this processing stage can generate accurate eye-feature descriptions. Finally, the template deformation process is applied to tracking eye features. @, 1997 Pattern Recognition Society. Published by Elsevier Science Ltd. Deformable templates Energy minimization Facial features Feature extraction

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Segmentation and reconstruction of on-line handwritten scripts

On-line handwritten scripts consist of sequences of components that are pen tip traces from pen-down to pen-up positions. This paper presents a segmentation and reconstruction procedure which segments components of a script into sequences of static strokes, and then reconstructs the script from these sequences. The segmentation is based on the extrema of curvature and in ection points in indivi...

متن کامل

Pii: S0031-3203(96)00148-3

-This paper presents a new algorithm for extracting IF-THEN rules from examples. The algorithm employs an efficient rule searching method and a simple metric for assessing rule generality and accuracy. The paper illustrates step by step the operation of the algorithm and discusses its performance on the IRIS data classification problem. © 1997 Pattern Recognition Society. Published by Elsevier ...

متن کامل

Finding prototypes for nearest neighbour classification by means of gradient descent and deterministic annealing

Abstraet--A new method is presented to find prototypes for a nearest neighbour classifier. The prototype locations are opfimised through a gradient descent and a deterministic annealing process. The proposed algorithm also includes an initialisation strategy which alms to provide the maximum classification rate on the training set with the minimum number of prototypes. Experiments show the effi...

متن کامل

Segmentation and recognition of connected handwritten numeral strings

-A new segmentation method for segmenting connected handwritten digit strings is presented. Unlike traditional methods where segmentation points are uniquely determined to cut the piece of stroke joining the connected numerals, our approach is one of identifying regions which serve as potential segmentation points. The regions are identified by a thorough analysis of the trajectory of strokes.....

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003